Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples
نویسندگان
چکیده
Given a set D of positive integers, the distance graph G(Z , D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, the vertex set is Z and the edge set is {uv : |u − v| ∈ D}. We call D the distance set. This paper studies chromatic and circular chromatic numbers of some distance graphs with certain distance sets. The circular chromatic number of a graph is a natural generalization of the chromatic number of a graph, introduced by Vince [15] as the name “star chromatic number.” Suppose p and q are positive integers such that p ≥ 2q . Let G be a graph with at least one edge. A (p, q)-coloring of G = (V, E) is a mapping c from V to {0, 1, . . . , p − 1} such that q ≤ |c(x)− c(y)| ≤ p− q for any edge xy in E . The circular chromatic number χc(G) of G is the infimum of the ratios p/q for which there exists a (p, q)-coloring of G. Note that for p ≥ 2, a (p, 1)-coloring of a graph G is simply an ordinary p-coloring of G. Therefore, χc(G) ≤ χ(G) for any graph G. Let G be a graph which is not a null graph. On the other hand, it has been shown [15] that for all finite graphs G, we have χ(G) − 1 < χc(G). Applying a result of de Bruijn and Erdős [6], this can be proved also for infinite graphs. Therefore, χ(G) = dχc(G)e if G 6= Nn . In particular, two graphs with the same circular chromatic number also have the same chromatic number. However, two graphs with the same chromatic number may have different circular chromatic numbers. Thus χc(G) is a refinement of χ(G), and it contains more information about the structure of the graph. It is usually much more difficult to determine the circular chromatic number of a graph than to determine its chromatic number. The fractional chromatic number of a graph is another well-known variation of the chromatic number. A fractional coloring of a graph G is a mapping c from I(G), the set of all independent sets of G, to the interval [0, 1] such that ∑
منابع مشابه
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval
Suppose S is a subset of a metric spaceM with a metric δ, and D a subset of positive real numbers. The distance graph G(S, D), with a distance set D, is the graph with vertex set S in which two vertices x and y are adjacent iff δ(x, y) ∈ D. Distance graphs, first studied by Eggleton et al. [7], were motivated by the well-known plane-coloring problem: What is the minimum number of colors needed ...
متن کاملDistance Graphs and T-Coloring
We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral set T that contains 0, the asymptotic T-coloring ratio R(T ) is equal to the fractional chromatic number of the distance graph G(Z, D), where D=T&[0]. This fact is then used to study the distance ...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملChromatic number of graphs with special distance sets, I
Given a subset D of positive integers, an integer distance graph is a graphG(Z, D) with the set Z of integers as vertex set and with an edge joining two vertices u and v if and only if |u−v| ∈ D. In this paper we consider the problem of determining the chromatic number of certain integer distance graphs G(Z, D)whose distance set D is either 1) a set of (n + 1) positive integers for which the n ...
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2000